全文获取类型
收费全文 | 968篇 |
免费 | 71篇 |
国内免费 | 4篇 |
学科分类
工业技术 | 1043篇 |
出版年
2024年 | 2篇 |
2023年 | 18篇 |
2022年 | 25篇 |
2021年 | 95篇 |
2020年 | 52篇 |
2019年 | 44篇 |
2018年 | 39篇 |
2017年 | 43篇 |
2016年 | 54篇 |
2015年 | 45篇 |
2014年 | 59篇 |
2013年 | 88篇 |
2012年 | 67篇 |
2011年 | 88篇 |
2010年 | 48篇 |
2009年 | 55篇 |
2008年 | 50篇 |
2007年 | 36篇 |
2006年 | 27篇 |
2005年 | 30篇 |
2004年 | 15篇 |
2003年 | 19篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1043条查询结果,搜索用时 140 毫秒
31.
Claudio Brunelli Fabio Garzia Davide Rossi Jari Nurmi 《Journal of Systems Architecture》2010,56(1):38-47
Signal processors exploiting ASIC acceleration suffer from sky-rocketing manufacturing costs and long design cycles. FPGA-based systems provide a programmable alternative for exploiting computation parallelism, but the flexibility they provide is not as high as in processor-oriented architectures: HDL or C-to-HDL flows still require specific expertise and a hardware knowledge background. On the other hand, the large size of the configuration bitstream and the inherent complexity of FPGA devices make their dynamic reconfiguration not a very viable approach. Coarse-grained reconfigurable architectures (CGRAs) are an appealing solution but they pose implementation problems and tend to be application specific. This paper presents a scalable CGRA which eases the implementation of algorithms on field programmable gate array (FPGA) platforms. This design option is based on two levels of programmability: it takes advantage of performance and reliability provided by state-of-the-art FPGA technology, and at the same time it provides the user with flexibility, performance and ease of reconfiguration typical of standard CGRAs. The basic cell template provides advanced features such as sub-word SIMD integer and floating-point computation capabilities, as well as saturating arithmetic. Multiple reconfiguration contexts and partial run-time reconfiguration capabilities are provided, tackling this way the problem of high reconfiguration overhead typical of FPGAs. Selected instances of the proposed architecture have been implemented on an Altera Stratix II EP2S180 FPGA. On this system, we mapped some common DSP, image processing, 3D graphics and audio compression algorithms in order to validate our approach and to demonstrate its effectiveness by benchmarking the benefits achieved. 相似文献
32.
Davide Anghinolfi Roberto Montemanni Massimo Paolucci Luca Maria Gambardella 《Computers & Operations Research》2011
The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are fulfilled, and the objective is to find a feasible solution with minimum cost. 相似文献
33.
Arnaud Grasset Philippe Millet Philippe Bonnot Sami Yehia Wolfram Putzke-Roeming Fabio Campi Alberto Rosti Michael Huebner Nikolaos S. Voros Davide Rossi Henning Sahlbach Rolf Ernst 《International journal of parallel programming》2011,39(3):328-356
Reconfigurable computing offers a wide range of low cost and efficient solutions for embedded systems. The proper choice of the reconfigurable device, the granularity of its processing elements and its memory architecture highly depend on the type of application and their data flow. Existing solutions either offer fine grain FPGAs, which rely on a hardware synthesis flow and offer the maximum degree of flexibility, or coarser grain solutions, which are usually more suitable for a particular type of data flow and applications. In this paper, we present the MORPHEUS architecture, a versatile reconfigurable heterogeneous System-on-Chip targeting streaming applications. The presented architecture exploits different reconfigurable technologies at several computation granularities that efficiently address the different applications needs. In order to efficiently exploit the presented architecture, we implemented a complete software solution to map C applications to the reconfigurable architecture. In this paper, we describe the complete toolset and provide concrete use cases of the architecture. 相似文献
34.
In this paper, we develop a theory of regular ω-languages that consist of ultimately periodic words only and we provide it
with an automaton-based characterization. The resulting class of automata, called ultimately periodic automata (UPA), is a
subclass of the class of Büchi automata and inherits some properties of automata over finite words (NFA). Taking advantage
of the similarities among UPA, Büchi automata, and NFA, we devise efficient solutions to a number of basic problems for UPA,
such as the inclusion, the equivalence, and the size optimization problems. The original motivation for developing a theory
of ultimately periodic languages and automata was to represent and to reason about sets of time granularities in knowledge-based
and database systems. In the last part of the paper, we show that UPA actually allow one to represent (possibly infinite)
sets of granularities, instead of single ones, in a compact and suitable to algorithmic manipulation way. In particular, we
describe an application of UPA to a concrete time granularity scenario taken from clinical medicine. 相似文献
35.
36.
Ayse Tosun Oscar Dieste Davide Fucci Sira Vegas Burak Turhan Hakan Erdogmus Adrian Santos Markku Oivo Kimmo Toro Janne Jarvinen Natalia Juristo 《Empirical Software Engineering》2017,22(6):2763-2805
Existing empirical studies on test-driven development (TDD) report different conclusions about its effects on quality and productivity. Very few of those studies are experiments conducted with software professionals in industry. We aim to analyse the effects of TDD on the external quality of the work done and the productivity of developers in an industrial setting. We conducted an experiment with 24 professionals from three different sites of a software organization. We chose a repeated-measures design, and asked subjects to implement TDD and incremental test last development (ITLD) in two simple tasks and a realistic application close to real-life complexity. To analyse our findings, we applied a repeated-measures general linear model procedure and a linear mixed effects procedure. We did not observe a statistical difference between the quality of the work done by subjects in both treatments. We observed that the subjects are more productive when they implement TDD on a simple task compared to ITLD, but the productivity drops significantly when applying TDD to a complex brownfield task. So, the task complexity significantly obscured the effect of TDD. Further evidence is necessary to conclude whether TDD is better or worse than ITLD in terms of external quality and productivity in an industrial setting. We found that experimental factors such as selection of tasks could dominate the findings in TDD studies. 相似文献
37.
Mario G. C. A. Cimino Filippo Palumbo Gigliola Vaglini Erina Ferro Nedo Celandroni Davide La Rosa 《Information Technology and Management》2017,18(3):223-239
A smart Information and Communication Technology (ICT) enables a synchronized interplay of different key factors, aligning infrastructures, consumers, and governmental policy-making needs. In the harbor’s logistics context, smart ICT has been driving a multi-year wave of growth. Although there is a standalone value in the technological innovation of a task, the impact of a new smart technology is unknown without quantitative analysis methods on the end-to-end process. In this paper, we first present a review of the smart ICT for marine container terminals, and then we propose to evaluate the impact of such smart ICT via business process model and notation (BPMN) modeling and simulation. The proposed approach is discussed in a real-world modeling and simulation analysis, made on a pilot terminal of the Port of Leghorn (Italy). 相似文献
38.
This paper deals with four solvers for combinatorial problems: the commercial state-of-the-art solver ILOG oplstudio, and the research answer set programming (ASP) systems dlv, smodels and cmodels. The first goal of this research is to evaluate the relative performance of such systems when used in a purely declarative
way, using a reproducible and extensible experimental methodology. In particular, we consider a third-party problem library,
i.e., the CSPLib, and uniform rules for modelling and instance selection. The second goal is to analyze the marginal effects
of popular reformulation techniques on the various solving technologies. In particular, we consider structural symmetry breaking,
the adoption of global constraints, and the addition of auxiliary predicates. Finally, we evaluate, on a subset of the problems,
the impact of numbers and arithmetic constraints on the different solving technologies. Results show that there is not a single
solver winning on all problems, and that reformulation is almost always beneficial: symmetry-breaking may be a good choice,
but its complexity has to be carefully chosen, by taking into account also the particular solver used. Global constraints
often, but not always, help opl, and the addition of auxiliary predicates is usually worth, especially when dealing with ASP solvers. Moreover, interesting
synergies among the various modelling techniques exist. 相似文献
39.
Real-time scheduling for energy harvesting sensor nodes 总被引:1,自引:1,他引:0
Energy harvesting has recently emerged as a feasible option to increase the operating time of sensor networks. If each node
of the network, however, is powered by a fluctuating energy source, common power management solutions have to be reconceived.
This holds in particular if real-time responsiveness of a given application has to be guaranteed. Task scheduling at the single
nodes should account for the properties of the energy source, capacity of the energy storage as well as deadlines of the single
tasks. We show that conventional scheduling algorithms (like e.g. EDF) are not suitable for this scenario. Based on this motivation,
we have constructed optimal scheduling algorithms that jointly handle constraints from both energy and time domain. Further
we present an admittance test that decides for arbitrary task sets, whether they can be scheduled without deadline violations.
To this end, we introduce the concept of energy variability characterization curves (EVCC) which nicely captures the dynamics
of various energy sources. Simulation results show that our algorithms allow significant reductions of the battery size compared
to Earliest Deadline First scheduling.
相似文献
Clemens MoserEmail: |
40.
Gianluca Buffa Davide Campanella Livan Fratini Fabrizio Micari 《International Journal of Material Forming》2016,9(5):613-618
Friction Stir Extrusion is a novel technique for direct recycling of metal scrap. In the process, a dedicated tool produces both the heat and the pressure to compact and extrude the original raw material, i.e., machining chip, as a consolidated component. A proper fixture was used to carry out an experimental campaign on Friction Stir Extrusion of AZ31 magnesium alloy. Variable tool rotation and extrusion ratio were considered. Appearance of defects and fractures was related to either too high or too low power input. The extruded rods were investigated both from the metallurgical and mechanical points of view. Tensile strength up to 80 % of the parent material was found for the best combination of process parameters. A peculiar 3D helical material flow was highlighted through metallurgical observation of the specimens. 相似文献